3 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the terms
7 // of the GNU General Public License as published by the Free Software
8 // Foundation; either version 3, or (at your option) any later
11 // This library is distributed in the hope that it will be useful, but
12 // WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 // General Public License for more details.
16 // Under Section 7 of GPL version 3, you are granted additional
17 // permissions described in the GCC Runtime Library Exception, version
18 // 3.1, as published by the Free Software Foundation.
20 // You should have received a copy of the GNU General Public License and
21 // a copy of the GCC Runtime Library Exception along with this program;
22 // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23 // <http://www.gnu.org/licenses/>.
25 // Copyright (C) 2004 Ami Tavory and Vladimir Dreizin, IBM-HRL.
27 // Permission to use, copy, modify, sell, and distribute this software
28 // is hereby granted without fee, provided that the above copyright
29 // notice appears in all copies, and that both that copyright notice
30 // and this permission notice appear in supporting documentation. None
31 // of the above authors, nor IBM Haifa Research Laboratories, make any
32 // representation about the suitability of this software for any
33 // purpose. It is provided "as is" without express or implied
37 * @file erase_fn_imps.hpp
38 * Contains an implementation class for a binary_heap.
46 for (size_type i = 0; i < m_size; ++i)
47 erase_at(m_a_entries, i, s_no_throw_copies_ind);
51 const size_type actual_size = resize_policy::get_new_size_for_arbitrary(0);
53 entry_pointer a_entries = s_entry_allocator.allocate(actual_size);
55 resize_policy::notify_arbitrary(actual_size);
57 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
59 m_actual_size = actual_size;
61 m_a_entries = a_entries;
68 _GLIBCXX_DEBUG_ONLY(assert_valid();)
74 erase_at(entry_pointer a_entries, size_type i, false_type)
76 a_entries[i]->~value_type();
78 s_value_allocator.deallocate(a_entries[i], 1);
84 erase_at(entry_pointer, size_type, true_type)
92 _GLIBCXX_DEBUG_ONLY(assert_valid();)
93 _GLIBCXX_DEBUG_ASSERT(!empty());
95 erase_at(m_a_entries, 0, s_no_throw_copies_ind);
97 std::pop_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
99 resize_for_erase_if_needed();
101 _GLIBCXX_DEBUG_ASSERT(m_size > 0);
104 _GLIBCXX_DEBUG_ONLY(assert_valid();)
108 template<typename Pred>
109 typename PB_DS_CLASS_C_DEC::size_type
113 _GLIBCXX_DEBUG_ONLY(assert_valid();)
123 const size_type left = partition(pred_t(pred));
125 _GLIBCXX_DEBUG_ASSERT(m_size >= left);
127 const size_type ersd = m_size - left;
129 for (size_type i = left; i < m_size; ++i)
130 erase_at(m_a_entries, i, s_no_throw_copies_ind);
134 const size_type actual_size =
135 resize_policy::get_new_size_for_arbitrary(left);
137 entry_pointer a_entries = s_entry_allocator.allocate(actual_size);
139 std::copy(m_a_entries, m_a_entries + left, a_entries);
141 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
143 m_actual_size = actual_size;
145 resize_policy::notify_arbitrary(m_actual_size);
152 std::make_heap(m_a_entries, m_a_entries + m_size, static_cast<entry_cmp& >(*this));
154 _GLIBCXX_DEBUG_ONLY(assert_valid();)
162 erase(point_iterator it)
164 _GLIBCXX_DEBUG_ONLY(assert_valid();)
165 _GLIBCXX_DEBUG_ASSERT(!empty());
167 const size_type fix_pos = it.m_p_e - m_a_entries;
169 std::swap(*it.m_p_e, m_a_entries[m_size - 1]);
171 erase_at(m_a_entries, m_size - 1, s_no_throw_copies_ind);
173 resize_for_erase_if_needed();
175 _GLIBCXX_DEBUG_ASSERT(m_size > 0);
178 _GLIBCXX_DEBUG_ASSERT(fix_pos <= m_size);
180 if (fix_pos != m_size)
181 fix(m_a_entries + fix_pos);
183 _GLIBCXX_DEBUG_ONLY(assert_valid();)
189 resize_for_erase_if_needed()
191 if (!resize_policy::resize_needed_for_shrink(m_size))
196 const size_type new_actual_size =
197 resize_policy::get_new_size_for_shrink();
199 entry_pointer a_new_entries = s_entry_allocator.allocate(new_actual_size);
201 resize_policy::notify_shrink_resize();
203 _GLIBCXX_DEBUG_ASSERT(m_size > 0);
204 std::copy(m_a_entries, m_a_entries + m_size - 1, a_new_entries);
206 s_entry_allocator.deallocate(m_a_entries, m_actual_size);
208 m_actual_size = new_actual_size;
210 m_a_entries = a_new_entries;
217 template<typename Pred>
218 typename PB_DS_CLASS_C_DEC::size_type
223 size_type right = m_size - 1;
225 while (right + 1 != left)
227 _GLIBCXX_DEBUG_ASSERT(left <= m_size);
229 if (!pred(m_a_entries[left]))
231 else if (pred(m_a_entries[right]))
235 _GLIBCXX_DEBUG_ASSERT(left < right);
237 std::swap(m_a_entries[left], m_a_entries[right]);